منابع مشابه
Bifibrational Functorial Semantics of Parametric Polymorphism
Reynolds’ theory of parametric polymorphism captures the invariance of polymorphically typed programs under change of data representation. Semantically, reflexive graph categories and fibrations are both known to give a categorical understanding of parametric polymorphism. This paper contributes further to this categorical perspective by showing the relevance of bifibrations. We develop a bifib...
متن کاملFunctorial ML
We present an extension of the Hindley-Milner type system that supports a generous class of type constructors called functors, and provide a parametrically polymorphic algorithm for their mapping, i.e. for applying a function to each datum appearing in a value of constructed type. The algorithm comes from shape theory, which provides a uniform method for locating data within a shape. The result...
متن کاملSolutions of Functorial and Non-functorial Metric Domain Equations 1
A new method for solving domain equations in categories of metric spaces is studied. The categories CMS and KMS are introduced, having complete and compact metric spaces as objects and-adjoint pairs as arrows. The existence and uniqueness of xed points for certain endofunctors on these categories is established. The classes of complete and compact metric spaces are considered as pseudo-metric s...
متن کاملSolutions of functorial and non-functorial metric domain equations
A new method for solving domain equations in categories of metric spaces is studied. The categories CMS≈ and KMS≈ are introduced, having complete and compact metric spaces as objects and -adjoint pairs as arrows. The existence and uniqueness of fixed points for certain endofunctors on these categories is established. The classes of complete and compact metric spaces are considered as pseudo-met...
متن کاملFunctorial Data Migration
In this paper we present a simple database definition language: that of categories and functors. A database schema is a category and a state is a set-valued functor. We show that morphisms of schemas induce three “data migration functors” that translate states from one schema to the other in canonical ways. Database states form a topos of which the classical “relational algebra” is a fragment. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90151-7